Národní úložiště šedé literatury Nalezeno 2 záznamů.  Hledání trvalo 0.00 vteřin. 
Mining Multi-Level Sequential Patterns
Šebek, Michal ; Platoš, Jan (oponent) ; Popelínský, Lubomír (oponent) ; Zendulka, Jaroslav (vedoucí práce)
Mining sequential patterns is a very important area of the data mining. Many industrial and business applications save sequential data where the ordering of transactions is defined. It can be used for example for analysis of consecutive shopping transactions. This thesis deals with the using of concept hierarchies of items for mining sequential patterns. This thesis focuses on two basic approaches - mining level-crossing sequential patterns and mining multi-level sequential patterns. The approaches for the both data mining tasks are formalized and there are proposed data mining algorithms hGSP and MLSP to solve these tasks. Experiments verified that mainly the MLSP has good performance and stability. The usability of newly obtained patterns is shown on the real-world data mining task.
Mining Multi-Level Sequential Patterns
Šebek, Michal ; Platoš, Jan (oponent) ; Popelínský, Lubomír (oponent) ; Zendulka, Jaroslav (vedoucí práce)
Mining sequential patterns is a very important area of the data mining. Many industrial and business applications save sequential data where the ordering of transactions is defined. It can be used for example for analysis of consecutive shopping transactions. This thesis deals with the using of concept hierarchies of items for mining sequential patterns. This thesis focuses on two basic approaches - mining level-crossing sequential patterns and mining multi-level sequential patterns. The approaches for the both data mining tasks are formalized and there are proposed data mining algorithms hGSP and MLSP to solve these tasks. Experiments verified that mainly the MLSP has good performance and stability. The usability of newly obtained patterns is shown on the real-world data mining task.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.